#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <bitset>
#include <utility>
using namespace std;

#define mm(a, n) memset(a, n, sizeof a)
#define mk(a, b) make_pair(a, b)

const double eps = 1e-6;
const int INF = 0x3f3f3f3f;

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
typedef pair<double, double> PDD;
typedef pair<LL, LL> PLL;
typedef pair<int, LL> PIL;

inline void quickread() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
}

const int N = 1e5 + 10;

int n, p;
LL nums[N];

int bounder(LL val) {
    int l = 0, r = n - 1;
    while (l <= r) {
        int mid = (l + r) >> 1;
        if (nums[mid] > val) r = mid - 1;
        else l = mid + 1;
    }
    return l;
}

inline void solution() {
    cin >> n >> p;
    for (int i = 0; i < n; i ++ ) cin >> nums[i];

    sort(nums, nums + n);

    int res = 0;
    for (int i = 0; i < n; i ++ ) {
        LL s = nums[i] * p;
        int pos = bounder(s);
        res = max(res, pos - i);
    }
    cout << res << endl;
}

int main() {
    freopen("input.txt", "r", stdin);
    quickread();
    solution();
    return 0;
}